$1$-MOVABLE CLIQUE DOMINATING SETS OF A GRAPH
نویسندگان
چکیده
منابع مشابه
Clique-like Dominating Sets
Continuing work by B acso and Tuza and Cozzens and Kelleher, we investigate dominating sets which induce subgraphs with small clique covering number, or small independence number. We show that if a graph G is connected and contains no induced subgraph isomorphic to P6 or Ht (the graph obtained by subdividing each edge of K1;t; t 3), then G has a dominating set which induces a connected graph wi...
متن کاملMovable Dominating Sensor Sets in Networks
In this paper we consider 1-movable dominating sets, motivated by the use of sensors employed to detect certain events in networks, where the sensors have a limited ability to react under changing conditions in the network. A 1-movable dominating set is a dominating set S ⊆ V (G) such that for every v ∈ S, either S − {v} is a dominating set, or there exists a vertex u ∈ (V (G) − S) ∩ N(v) such ...
متن کاملMovable Separability of Sets
An exact hidden sphere algorithm that operates in linear time " , Comput
متن کاملDifferent-Distance Sets in a Graph
A set of vertices $S$ in a connected graph $G$ is a different-distance set if, for any vertex $w$ outside $S$, no two vertices in $S$ have the same distance to $w$.The lower and upper different-distance number of a graph are the order of a smallest, respectively largest, maximal different-distance set.We prove that a different-distance set induces either a special type of path or an independent...
متن کاملMinimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration
The maximum number of minimal dominating sets that a graph on n vertices can have is known to be at most 1.7159. This upper bound might not be tight, since no examples of graphs with 1.5705 or more minimal dominating sets are known. For several classes of graphs, we substantially improve the upper bound on the maximum number of minimal dominating sets in graphs on n vertices. In some cases, we ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Pure and Apllied Mathematics
سال: 2016
ISSN: 1311-8080,1314-3395
DOI: 10.12732/ijpam.v106i2.10